package foundation.tree.binaryTree;

import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;

/**
 * @author hang an
 * @since 2025/7/12
 */
public class 二叉树的最小深度 {
    public int minDepth(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null) return minDepth(root.right) + 1;
        if (root.right == null) return minDepth(root.left) + 1;
        return Math.min(minDepth(root.left), minDepth(root.right)) + 1;
    }
}
